29c6ad3aada00f324995ab137259de2f39e25813,Net2Plan-Examples/src/main/java/com/net2plan/examples/ocnbook/onlineSim/Online_evProc_congestionControlPrimal.java,Online_evProc_congestionControlPrimal,initialize,#NetPlan#Map#Map#Map#,121

Before Change


		/* Remove all routes, and create one with the shortest path in km for each demand */
		currentNetPlan.removeAllUnicastRoutingInformation();
		currentNetPlan.setRoutingType(RoutingType.SOURCE_ROUTING);
		currentNetPlan.addRoutesFromCandidatePathList(currentNetPlan.getVectorLinkLengthInKm().toArray()  , "K" , "1");

		this.control_isBarrierMethod = gradient_penaltyMethod.getString ().equals ("barrier");
		this.control_epsilonOrMuFactor = control_isBarrierMethod? gradient_interiorPenaltyEpsilonFactor.getDouble() : gradient_exteriorPenaltyMuFactor.getDouble();

After Change


		/* Remove all routes, and create one with the shortest path in km for each demand */
		currentNetPlan.removeAllUnicastRoutingInformation();
		currentNetPlan.setRoutingType(RoutingType.SOURCE_ROUTING);
		this.currentNetPlan.addRoutesFromCandidatePathList(currentNetPlan.computeUnicastCandidatePathList(currentNetPlan.getVectorLinkLengthInKm() , 1, -1, -1, -1, -1, -1, -1 , null));


		this.control_isBarrierMethod = gradient_penaltyMethod.getString ().equals ("barrier");